Distribution free bounds for service constrained (Q, r) inventory systems
نویسندگان
چکیده
منابع مشابه
Distribution Free Bounds for Service Constrained (Q, r) Inventory Systems
A classical and important problem in stochastic inventory theory is to determine the order quantity (Q) and the reorder level (r) to minimize inventory holding and backorder costs subject to a service constraint that the fill rate, i.e., the fraction of demand satisfied by inventory in stock, is at least equal to a desired value. This problem is often hard to solve because the fill rate constra...
متن کاملModified Echelon (r, Q) Policies with Guaranteed Performance Bounds for Stochastic Serial Inventory Systems
We consider the classic continuous-review N stage serial inventory system with a homogeneous Poisson demand arrival process at the most downstream stage (Stage 1). Any shipment to each stage, regardless of its size, incurs a positive fixed setup cost and takes a positive constant lead time. The optimal policy for this system under the long-run average cost criterion is unknown. Finding a good w...
متن کاملThe (Q, r) Inventory Policy in Production- Inventory Systems
We examine the effectiveness of the conventional (Q, r) model in managing production-inventory systems with finite capacity, stochastic demand, and stochastic order processing times. We show that, for systems with finite production capacity, order replenishment lead times are highly sensitive to loading and order quantity. Consequently, the choice of optimal order quantity and optimal reorder p...
متن کاملAn Iterative Heuristic Optimization Model for Multi-Echelon (R, Q) Inventory Systems
Large multi-echelon inventory systems usually consist of hundreds of thousands of stock keep units (SKU). Calculating inventory policies for each product is a computational burden that necessitates the need for more efficient policy setting techniques that reduce computational time and increases managerial convenience. The main objective of our research is to investigate the effect of segmentat...
متن کاملAn Efficient Algorithm for Computing an Optimal (r, Q) Policy in Continuous Review Stochastic Inventory Systems
The reorder point/reorder quantity policies, also referred to as (r, Q) policies, are widely used in industry and extensively studied in the literature. However, for a period of almost 30 years there has been no efficient algorithm for computing optimal control parameters for such policies. In this paper, we present a surprisingly simple and efficient algorithm for the determination of an optim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Naval Research Logistics
سال: 2000
ISSN: 0894-069X,1520-6750
DOI: 10.1002/1520-6750(200012)47:8<635::aid-nav3>3.0.co;2-c